Well-foundedness in Realizability
نویسندگان
چکیده
منابع مشابه
Mathematical Logic Well-foundedness in realizability
However, the implication from (1) to (2) is equivalent to the principle of dependent choices (as the reader can show for himself) and cannot be proved in ZF. A relation < on X is called well-founded if any of these statements holds. Intuitionistically, the three statements are far from equivalent (hence, in formalizing an intuitionistic notion of well-foundedness, care is needed). Notion (1) is...
متن کاملFrom hierarchies to well-foundedness
We highlight that the connection of well-foundedness and recursive definitions is more than just convenience. While the consequences of making well-foundedness a sufficient condition for the existence of hierarchies (of various complexity) have been extensively studied, we point out that (if parameters are allowed) well-foundedness is a necessary condition for the existence of hierarchies e.g. ...
متن کاملWell-foundedness of Term Orderings
Well-foundedness is the essential property of orderings for proving termination. We introduce a simple criterion on term orderings such that any term ordering possessing the subterm property and satisfying this criterion is well-founded. The usual path orders fulfil this criterion, yielding a much simpler proof of well-foundedness than the classical proof depending on Kruskal's theorem. Even mo...
متن کاملOn Same Equivalents of Well-foundedness
Four statements equivalent to well-foundedness (well-founded induction, existence of recursively defined functions, uniqueness of recursively defined functions, and absence of descending ω-chains) have been proved in Mizar and the proofs were mechanically checked for correctness. It seems not to be widely known that the existence (without the uniqueness assumption) of recursively defined functi...
متن کاملWell-foundedness in Credit-Based Flow-Control Systems
Formal verification of liveness properties of practical communication fabrics are generally intractable with present day bit-level verification tools. We focus on a particular type of liveness called response. We show that a well-founded relation can be extracted from a high-level design of a communication fabric. This well-founded relation yields a set of local safety assertions, which are mor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Archive for Mathematical Logic
سال: 2006
ISSN: 0933-5846,1432-0665
DOI: 10.1007/s00153-006-0003-5